Given an integer array nums, find a subarray that has the largest product, and return the product.
The test cases are generated so that the answer will fit in a 32-bit integer.
Input: nums = [2,3,-2,4] Output: 6 Explanation: [2,3] has the largest product 6.
Input: nums = [-2,0,-1] Output: 0 Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
1 <= nums.length <= 2 * 104-10 <= nums[i] <= 10- The product of any prefix or suffix of
numsis guaranteed to fit in a 32-bit integer.
implSolution{pubfnmax_product(nums:Vec<i32>) -> i32{letmut ret = *nums.iter().max().unwrap();for slice in nums.split(|&num| num == 0){if slice.iter().filter(|&&num| num < 0).count() % 2 == 1{let i = slice.iter().position(|&num| num < 0).unwrap();let j = slice.iter().rposition(|&num| num < 0).unwrap();if i + 1 < slice.len(){ ret = ret.max(slice.iter().skip(i + 1).product());}if j > 0{ ret = ret.max(slice.iter().take(j).product());}}elseif !slice.is_empty(){ ret = ret.max(slice.iter().product());}} ret }}